package main.java.LeetCode.ClassicalAlgorithm.KnapsackProblem;

public interface Knapsack {
    int bestChoose(int[] weights,int[] values,int cap);
    int bestChooseForMultiple(int[] conditions1,int[] conditions2,int[] values,int cap1,int cap2);

}
